A forbidden subgraph characterization of some graph classes using betweenness axioms

نویسندگان

  • Manoj Changat
  • Anandavally K. Lakshmikuttyamma
  • Joseph Mathews
  • Iztok Peterin
  • Prasanth G. Narasimha-Shenoi
  • Geetha Seethakuttyamma
  • Simon Spacapan
چکیده

Let IG(x, y) and JG(x, y) be the geodesic and induced path interval between x and y in a connected graph G, respectively. The following three betweenness axioms are considered for a set V and R : V × V → 2 (i) x ∈ R(u, y), y ∈ R(x, v), x 6= y, |R(u, v)| > 2 ⇒ x ∈ R(u, v) (ii) x ∈ R(u, v) ⇒ R(u, x) ∩R(x, v) = {x} (iii)x ∈ R(u, y), y ∈ R(x, v), x 6= y,⇒ x ∈ R(u, v). We characterize the class of graphs for which IG satisfies (i), and the class for which JG satisfies (ii) and the class for which IG or JG satisfies (iii). The characterization is given by forbidden induced subgraphs. The class of graphs that we characterize include a proper subclass and superclass of distance hereditary graphs and we give an axiomatic characterization of chordal and Ptolemaic graphs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exponential Families of Minimally Non-coordinated Graphs

A graph G is coordinated if, for every induced subgraph H of G, the minimum number of colors that can be assigned to the cliques of H in such a way that no two cliques with non-empty intersection receive the same color is equal to the maximum number of cliques of H with a common vertex. In a previous work, coordinated graphs were characterized by minimal forbidden induced subgraphs within some ...

متن کامل

Automatic Deduction of Induced Subgraphs of Some Infinite Families of Graphs

Graph class C is induced-hereditary if for every graph G in C, every induced subgraph of G belongs to C. Induced-hereditary graph classes allow characterisation by sets of forbidden induced subgraphs. Such characterisations are very useful for automatic deduction of relations between graph classes. However, sometimes those sets of forbidden induced subgraphs are infinite, what makes it difficul...

متن کامل

On Self-complementary Chordal Graphs Defined by Single Forbidden Induced Subgraph

In this paper we deal with several subclasses of self complementary chordal graphs characterized by single forbidden induced subgraph namely Chairfree sc chordal graphs, H-free sc chordal graphs and Cross (star1, 1, 1, 2)-free sc chordal graphs. We obtain some results on these classes and an algorithm is proposed based on these results that recognize these classes. We also compile a catalogue o...

متن کامل

On minimal forbidden subgraph characterizations of balanced graphs

A graph is balanced if its clique-matrix contains no edge-vertex incidence matrix of an odd chordless cycle as a submatrix. While a forbidden induced subgraph characterization of balanced graphs is known, there is no such characterization by minimal forbidden induced subgraphs. In this work, we provide minimal forbidden induced subgraph characterizations of balanced graphs restricted to graphs ...

متن کامل

A semi-induced subgraph characterization of upper domination perfect graphs

Let β(G) and Γ(G) be the independence number and the upper domination number of a graphG, respectively. A graph G is called Γ-perfect if β(H) = Γ(H), for every induced subgraph H of G. The class of Γ-perfect graphs generalizes such well-known classes of graphs as strongly perfect graphs, absorbantly perfect graphs, and circular arc graphs. In this article, we present a characterization of Γ-per...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 313  شماره 

صفحات  -

تاریخ انتشار 2013